One to Rule Them All: A General Randomized Algorithm for Buffer Management with Bounded Delay
نویسنده
چکیده
We give a memoryless scale-invariant randomized algorithm Mix-R for buffer management with bounded delay that is e/(e − 1)-competitive against an adaptive adversary, together with better performance guarantees for many restricted variants, including the s-bounded instances. In particular, Mix-R attains the optimum competitive ratio of 4/3 on 2-bounded instances. Both Mix-R and its analysis are applicable to a more general problem, called Collecting Items, in which only the relative order between packets’ deadlines is known. Mix-R is the optimal memoryless randomized algorithm against adaptive adversary for that problem in a strong sense. While some of provided upper bounds were already known, in general, they were attained by several different algorithms.
منابع مشابه
Bounded delay packet scheduling in a bounded buffer
We study the problem of buffer management in QoS-enabled network switches in the bounded delay model where each packet is associated with a weight and a deadline. We consider the more realistic situation where the network switch has a finite buffer size. A 9.82-competitive algorithm is known for the case of multiple buffers (Azar and Levy, SWAT’06). Recently, for the case of a single buffer, a ...
متن کاملA Novel Method for Selecting the Supplier Based on Association Rule Mining
One of important problems in supply chains management is supplier selection. In a company, there are massive data from various departments so that extracting knowledge from the company’s data is too complicated. Many researchers have solved this problem by some methods like fuzzy set theory, goal programming, multi objective programming, the liner programming, mixed integer programming, analyti...
متن کاملRandomized Algorithms for Buffer Management with 2-Bounded Delay
In the buffer management problem with bounded delay, weighted packets arrive at a network switch over time, and the goal is to send those packets before their deadlines while maximizing the total weight of the packets sent. In the 2-bounded delay case, each packet has to be sent either in the step of its release or in the next step. In the deterministic case, the optimal competitive ratio for t...
متن کاملRandomized competitive algorithms for online buffer management in the adaptive adversary model
In the problem of buffer management with bounded delay, packets with weights and deadlines arrive at a network switch over time, and the goal is to send those packets on the outgoing link while maximizing the total weight of the packets that are sent before their deadlines. We present a study of randomized algorithms that are competitive against an adaptive adversary. Previous studies considere...
متن کاملUsing a Fuzzy Rule-based Algorithm to Improve Routing in MPLS Networks
Today, the use of wireless and intelligent networks are widely used in many fields such as information technology and networking. There are several types of these networks that MPLS networks are one of these types. However, in MPLS networks there are issues and problems in the design and implementation discussion, for example security, throughput, losses, power consumption and so on. Basically,...
متن کامل